Complete symbolic reachability analysis using back-and-forth narrowing
نویسندگان
چکیده
منابع مشابه
Complete Symbolic Reachability Analysis Using Back-and-Forth Narrowing
We propose a method called back-and-forth narrowing for solving reachability goals of the form (∃−→x ).t1 →∗ t1 ∧ . . . ∧ tn →∗ tn in general term rewrite systems. The method is a complete semi-decision procedure in the sense that it is guaranteed to find a solution when one exists, but in general it may not terminate when there are no solutions. The completeness result is very general in that ...
متن کاملSymbolic Reachability Analysis Using Narrowing and its Application to Verification of Cryptographic Protocols
Narrowing was introduced, and has traditionally been used, to solve equations in initial and free algebras modulo a set of equations E . This paper proposes a generalization of narrowing which can be used to solve reachability goals in initial and free models of a rewrite theory R . We show that narrowing is sound and weakly complete (i.e., complete for normalized solutions) under appropriate e...
متن کاملVariants, Unification, Narrowing, and Symbolic Reachability in Maude 2.6
This paper introduces some novel features of Maude 2.6 focusing on the variants of a term. Given an equational theory (Σ,Ax∪E), the E,Ax-variants of a term t are understood as the set of all pairs consisting of a substitution σ and the E,Ax-canonical form of tσ . The equational theory (Ax∪E) has the finite variant property iff there is a finite set of most general variants. We have added suppor...
متن کاملDistributed Symbolic Reachability Analysis
Model checking is an important tool in program verification and software validation. Model checkers generally examine the entire state space of a model to find behaviour that differs from a given formal specification. Most temporal safety properties can be verified via reachability analysis. A major limitation is the state space explosion problem, which occurs when the state space does not fit ...
متن کاملBack and forth bisimulations
This paper is concerned with bisimulation relations which do not only require related agents to simulate each others behavior in the direction of the arrows, but also to simulate each other when going back in history. First it is demonstrated that the back and forth variant of strong bisimulation leads to the same equivalence as the ordinary notion of strong bisimulation. Then it is shown that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.07.008